Generalized resolution search
نویسندگان
چکیده
Difficult discrete optimization problems are often solved using a Branch and Bound approach. Resolution search is an alternate approach proposed by Chvátal for 0-1 problems, allowing more flexibility in the search process. In this paper, we generalize the Resolution Search to any discrete problem.
منابع مشابه
Generalized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملLinear Resolutions of Powers of Generalized Mixed Product Ideals
Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...
متن کاملQ-Resolution with Generalized Axioms
Q-resolution is a proof system for quantified Boolean formulas (QBFs) in prenex conjunctive normal form (PCNF) which underlies search-based QBF solvers with clause and cube learning (QCDCL). With the aim to derive and learn stronger clauses and cubes earlier in the search, we generalize the axioms of the Q-resolution calculus resulting in an exponentially more powerful proof system. The general...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملGeneralized ensemble methods for de novo structure prediction.
Current methods for predicting protein structure depend on two interrelated components: (i) an energy function that should have a low value near the correct structure and (ii) a method for searching through different conformations of the polypeptide chain. Identification of the most efficient search methods is essential if we are to be able to apply such methods broadly and with confidence. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 8 شماره
صفحات -
تاریخ انتشار 2011